Date: Tue, 05 Nov 1996 00:32:02 GMT
Server: NCSA/1.5
Content-type: text/html
Last-modified: Wed, 02 Oct 1996 18:58:12 GMT
Content-length: 3028

<!--This file created 9/30/96 3:30 PM by Claris Home Page version 1.0b1-->
<HTML>
<HEAD>
   <TITLE>JT-HW3.html</TITLE>
   <X-SAS-WINDOW TOP=-9 BOTTOM=473 LEFT=-762 RIGHT=-154>
</HEAD>
<BODY>

<H1 ALIGN=CENTER><FONT SIZE=5>CS354, Fall 1996</FONT></H1>

<H1 ALIGN=CENTER><FONT SIZE=5>Homework 3, due Wed Oct 9 at the start
of class.</FONT></H1>

<H3><TABLE BORDER=1 CELLPADDING=1 WIDTH="100%" HEIGHT=35>
   <TR>
      <TD>
         <P><B><FONT SIZE=4 COLOR="#AF0000">Name
         (printed):</FONT></B>
      </TD><TD>
         <P><B><FONT SIZE=4 COLOR="#AF0000">Name (signed):</FONT></B>
      
      </TD></TR>
</TABLE></H3>

<H3>Grader:</H3>

<P><TABLE BORDER=1 CELLPADDING=1 WIDTH="24%">
   <TR>
      <TD>
         <P>Mohammad
      </TD><TD>
         <P>&nbsp;
      </TD></TR>
   <TR>
      <TD>
         <P>Sridevi
      </TD><TD>
         <P>&nbsp;
      </TD></TR>
   <TR>
      <TD>
         <P>Sunlung
      </TD><TD>
         <P>&nbsp;
      </TD></TR>
</TABLE></P>

<H3>Total score:</H3>

<P><FONT COLOR="#000000">(1) (4 points) Find the largest IEEE 32 bit
floating point number that does not have an integer value. Express
the answer in binary and in decimal.</FONT></P>

<P><FONT COLOR="#000000">&nbsp;</FONT></P>

<P><FONT COLOR="#000000">&nbsp;</FONT></P>

<P><FONT COLOR="#000000">&nbsp;</FONT></P>

<P><FONT COLOR="#000000">&nbsp;</FONT></P>

<P><FONT COLOR="#000000">&nbsp;</FONT></P>

<P><FONT COLOR="#000000">(2) (2 points each, 6 points total) Write
the hexadecimal values for x, y and z just after the following code
executes:</FONT></P>

<BLOCKQUOTE><PRE><FONT COLOR="#000000">move x, 0x0f0fc123
and  x, x, 0xff00f000      # x = ?
not  x, x                  # x = ?
move y, 0x8f0aabc9
sll  y, y, 5               # y = ?
nor  z, x, y               # z = ?</FONT></PRE></BLOCKQUOTE>

<P><FONT COLOR="#000000">&nbsp;</FONT></P>

<P><FONT COLOR="#000000">&nbsp;</FONT></P>

<P><FONT COLOR="#000000">(3) (3 points each, 6 points total) Do the
following 2's complement multiplication. Indicate if either
computation overflows for 12 bit words, for 6 bit words. Show your
work. Check your results by redoing the computation in
decimal.</FONT></P>

<BLOCKQUOTE><BLOCKQUOTE><BLOCKQUOTE><PRE><FONT COLOR="#000000">  
  001010                                   001010
x 111100                                 x 000011
--------                                 --------</FONT></PRE>
</BLOCKQUOTE></BLOCKQUOTE>

<PRE><FONT COLOR="#000000">&nbsp;
&nbsp;
&nbsp;
&nbsp;
&nbsp;
&nbsp;
&nbsp;
&nbsp;
&nbsp;
&nbsp;
&nbsp;
&nbsp;</FONT></PRE></BLOCKQUOTE>

<P><FONT COLOR="#000000">(4) (4 points) Show that the following two
code segments give the same value for c, for any values of a and b.
Hint: consider truth tables (see page 116 of the text).</FONT></P>

<BLOCKQUOTE>
<PRE><FONT COLOR="#000000">
     and c, a, b                                 not c, a
     not c                                       not d, b
                                                 or  c, c, d
</FONT></PRE>
</BLOCKQUOTE>
</BODY>
</HTML>

